A modular equality for Cameron–Liebler line classes
نویسندگان
چکیده
منابع مشابه
A modular equality for Cameron-Liebler line classes
In this paper we prove that a Cameron-Liebler line class L in PG(3, q) with parameter x has the property that ( x 2 ) +n(n−x) ≡ 0 mod q+1 for the number n of lines of L in any plane of PG(3, q). It follows that the modular equation ( x 2 ) + n(n − x) ≡ 0 mod q + 1 has an integer solution in n. This result rules out roughly at least one half of all possible parameters x. As an application of our...
متن کاملCharacterizing classes defined without Equality
In this paper we mainly deal with first-order languages without equality and introduce a weak form of equality predicate, the so-called Leibniz equality. This equality is characterized algebraically by means of a natural concept of congruence; in any structure, it turns out to be the maximum congruence of the structure. We show that first-order logic without equality has two distinct complete s...
متن کاملA Proposed Model for Evaluating Modular Education
Introduction: Educational evaluation is one of the main elements of educational systems. It also has a particular role in different educational standards such as ISO 10015. It seems that oral and written examinations are not enough for an effective evaluation of instructions. In order to accomplish an efficient educational evaluation, an evaluation model was designed for educational assessment ...
متن کاملModular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pure, only involving clauses over the alphabet of either one, but not both, of the theories. The calculus is shown to be complete provided that functions that are not in the intersection of the component signatures are d...
متن کاملModular proof systems for partial functions with Evans equality
The paper presents a modular superposition calculus for the combination of firstorder theories involving both total and partial functions. The modularity of the calculus is a consequence of the fact that all the inferences are pure – only involving clauses over the alphabet of either one, but not both, of the theories – when refuting goals represented by sets of pure formulae. The calculus is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2014
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2014.06.004